Dependent Types in Haskell: Theory and Practice

نویسنده

  • Richard A. Eisenberg
چکیده

DEPENDENT TYPES IN HASKELL: THEORY AND PRACTICE Richard A. Eisenberg

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Closed Type Families With Overlapping Equations (Extended Version)

Open, type-level functions are a recent innovation in Haskell that move Haskell towards the expressiveness of dependent types, while retaining the look and feel of a practical programming language. This paper shows how to increase expressiveness still further, by adding closed type functions whose equations may overlap, and may have non-linear patterns over an open type universe. Although pract...

متن کامل

On type-based termination and dependent pattern matching in the calculus of inductive constructions. (Terminaison basée sur les types et filtrage dépendant pour le calcul des constructions inductives)

Proof assistants based on dependent type theory are progressively used as a tool to develop certified programs. A successful example is the Coq proof assistant, an implementation of a dependent type theory called the Calculus of Inductive Constructions (CIC). Coq is a functional programming language with an expressive type system that allows to specify and prove properties of programs in a high...

متن کامل

A functional specification of effects

This dissertation is about effects and type theory. Functional programming languages such as Haskell demonstrate that monads can safely encapsulated side effects. If you want to reason about effectful code, however, it is not enough to only encapsulate effects: you must explain their meaning. In this dissertation I provide pure specifications of effects in type theory. After initial investigati...

متن کامل

Generic Haskell: Practice and Theory

4 Generic Haskell is an extension of Haskell that supports the construction of generic programs. This article describes the basics of Generic Haskell and highlights the underlying theory.

متن کامل

Epigram reloaded: a standalone typechecker for ETT

Epigram 1 [18, 3] is at the same time a functional programming language with dependent types and a type-driven, interactive program development system. Epigram’s type system is strong enough to express a wide range of program properties, from basic structural invariants to full specifications. The system supports the interactive development of programs exploiting types to direct the design proc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1610.07978  شماره 

صفحات  -

تاریخ انتشار 2015